An exploratory application of constraint optimization in mozart to probabilistic natural language processing
Identifieur interne :
000029 ( PascalFrancis/Curation );
précédent :
000028;
suivant :
000030
An exploratory application of constraint optimization in mozart to probabilistic natural language processing
Auteurs : Irene Langkilde-Geary [
États-Unis]
Source :
-
Lecture notes in computer science [ 0302-9743 ] ; 2005.
RBID : Pascal:05-0295484
Descripteurs français
English descriptors
Abstract
This paper describes an exploratory implementation in Mozart applying constraint optimization to basic subproblems of parsing and generation. Optimization is performed on the probability of a sentence using a dependency-style syntactic representation, which is computed using an adaptation of the English Penn Treebank as data. The same program solves both parsing and generation subproblems, providing the flexibility of a general architecture combined with practical efficiency. We show results on a sample sentence that is a classic in natural language processing.
| pA |
| A01 | 01 | 1 | | @0 0302-9743 |
|---|
| A05 | | | | @2 3438 |
|---|
| A08 | 01 | 1 | ENG | @1 An exploratory application of constraint optimization in mozart to probabilistic natural language processing |
|---|
| A09 | 01 | 1 | ENG | @1 CSLP 2004 : constraint solving and language processing : Roskilde, 1-3 September 2004, revised selected and invited papers |
|---|
| A11 | 01 | 1 | | @1 LANGKILDE-GEARY (Irene) |
|---|
| A12 | 01 | 1 | | @1 CHRISTIANSEN (Henning) @9 ed. |
|---|
| A12 | 02 | 1 | | @1 SKADHAUGE (Peter Rossen) @9 ed. |
|---|
| A12 | 03 | 1 | | @1 VILLADSEN (Jorgen) @9 ed. |
|---|
| A14 | 01 | | | @1 Brigham Young University @2 Provo UT 84602 @3 USA @Z 1 aut. |
|---|
| A20 | | | | @1 172-183 |
|---|
| A21 | | | | @1 2005 |
|---|
| A23 | 01 | | | @0 ENG |
|---|
| A26 | 01 | | | @0 3-540-26165-6 |
|---|
| A43 | 01 | | | @1 INIST @2 16343 @5 354000124486690110 |
|---|
| A44 | | | | @0 0000 @1 © 2005 INIST-CNRS. All rights reserved. |
|---|
| A45 | | | | @0 12 ref. |
|---|
| A47 | 01 | 1 | | @0 05-0295484 |
|---|
| A60 | | | | @1 P @2 C |
|---|
| A61 | | | | @0 A |
|---|
| A64 | 01 | 1 | | @0 Lecture notes in computer science |
|---|
| A66 | 01 | | | @0 DEU |
|---|
| C01 | 01 | | ENG | @0 This paper describes an exploratory implementation in Mozart applying constraint optimization to basic subproblems of parsing and generation. Optimization is performed on the probability of a sentence using a dependency-style syntactic representation, which is computed using an adaptation of the English Penn Treebank as data. The same program solves both parsing and generation subproblems, providing the flexibility of a general architecture combined with practical efficiency. We show results on a sample sentence that is a classic in natural language processing. |
|---|
| C02 | 01 | X | | @0 001D02C04 |
|---|
| C03 | 01 | X | FRE | @0 Linguistique mathématique @5 01 |
|---|
| C03 | 01 | X | ENG | @0 Computational linguistics @5 01 |
|---|
| C03 | 01 | X | SPA | @0 Linguística matemática @5 01 |
|---|
| C03 | 02 | X | FRE | @0 Satisfaction contrainte @5 02 |
|---|
| C03 | 02 | X | ENG | @0 Constraint satisfaction @5 02 |
|---|
| C03 | 02 | X | SPA | @0 Satisfaccion restricción @5 02 |
|---|
| C03 | 03 | X | FRE | @0 Langage probabiliste @5 06 |
|---|
| C03 | 03 | X | ENG | @0 Probabilistic language @5 06 |
|---|
| C03 | 03 | X | SPA | @0 Lenguaje probabilista @5 06 |
|---|
| C03 | 04 | X | FRE | @0 Langage naturel @5 07 |
|---|
| C03 | 04 | X | ENG | @0 Natural language @5 07 |
|---|
| C03 | 04 | X | SPA | @0 Lenguaje natural @5 07 |
|---|
| C03 | 05 | X | FRE | @0 Traitement langage @5 08 |
|---|
| C03 | 05 | X | ENG | @0 Language processing @5 08 |
|---|
| C03 | 05 | X | SPA | @0 Tratamiento lenguaje @5 08 |
|---|
| C03 | 06 | X | FRE | @0 Analyse syntaxique @5 09 |
|---|
| C03 | 06 | X | ENG | @0 Syntactic analysis @5 09 |
|---|
| C03 | 06 | X | SPA | @0 Análisis sintáxico @5 09 |
|---|
| C03 | 07 | X | FRE | @0 Phrase @5 18 |
|---|
| C03 | 07 | X | ENG | @0 Sentence @5 18 |
|---|
| C03 | 07 | X | SPA | @0 Frase @5 18 |
|---|
| C03 | 08 | X | FRE | @0 Optimisation sous contrainte @5 23 |
|---|
| C03 | 08 | X | ENG | @0 Constrained optimization @5 23 |
|---|
| C03 | 08 | X | SPA | @0 Optimización con restricción @5 23 |
|---|
| C03 | 09 | X | FRE | @0 Approche probabiliste @5 24 |
|---|
| C03 | 09 | X | ENG | @0 Probabilistic approach @5 24 |
|---|
| C03 | 09 | X | SPA | @0 Enfoque probabilista @5 24 |
|---|
| N21 | | | | @1 206 |
|---|
| N44 | 01 | | | @1 OTO |
|---|
| N82 | | | | @1 OTO |
|---|
|
|---|
| pR |
| A30 | 01 | 1 | ENG | @1 Constraint solving and language processing. International workshop @2 1 @3 Roskilde DNK @4 2004-09-01 |
|---|
|
|---|
Links toward previous steps (curation, corpus...)
- to stream PascalFrancis, to step Corpus: Pour aller vers cette notice dans l'étape Curation :000176
Links to Exploration step
Pascal:05-0295484
Le document en format XML
<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" level="a">An exploratory application of constraint optimization in mozart to probabilistic natural language processing</title>
<author><name sortKey="Langkilde Geary, Irene" sort="Langkilde Geary, Irene" uniqKey="Langkilde Geary I" first="Irene" last="Langkilde-Geary">Irene Langkilde-Geary</name>
<affiliation wicri:level="1"><inist:fA14 i1="01"><s1>Brigham Young University</s1>
<s2>Provo UT 84602</s2>
<s3>USA</s3>
<sZ>1 aut.</sZ>
</inist:fA14><country>États-Unis</country>
</affiliation><publicationStmt><idno type="wicri:source">INIST</idno>
<idno type="inist">05-0295484</idno>
<date when="2005">2005</date>
<idno type="stanalyst">PASCAL 05-0295484 INIST</idno>
<idno type="RBID">Pascal:05-0295484</idno>
<idno type="wicri:Area/PascalFrancis/Corpus">000176</idno>
<idno type="wicri:Area/PascalFrancis/Curation">000029</idno>
</publicationStmt><sourceDesc><biblStruct><analytic><title xml:lang="en" level="a">An exploratory application of constraint optimization in mozart to probabilistic natural language processing</title>
<author><name sortKey="Langkilde Geary, Irene" sort="Langkilde Geary, Irene" uniqKey="Langkilde Geary I" first="Irene" last="Langkilde-Geary">Irene Langkilde-Geary</name>
<affiliation wicri:level="1"><inist:fA14 i1="01"><s1>Brigham Young University</s1>
<s2>Provo UT 84602</s2>
<s3>USA</s3>
<sZ>1 aut.</sZ>
</inist:fA14><country>États-Unis</country>
</affiliation><series><title level="j" type="main">Lecture notes in computer science</title>
<idno type="ISSN">0302-9743</idno>
<imprint><date when="2005">2005</date>
</imprint><seriesStmt><title level="j" type="main">Lecture notes in computer science</title>
<idno type="ISSN">0302-9743</idno>
</seriesStmt><profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>Computational linguistics</term>
<term>Constrained optimization</term>
<term>Constraint satisfaction</term>
<term>Language processing</term>
<term>Natural language</term>
<term>Probabilistic approach</term>
<term>Probabilistic language</term>
<term>Sentence</term>
<term>Syntactic analysis</term>
</keywords><keywords scheme="Pascal" xml:lang="fr"><term>Linguistique mathématique</term>
<term>Satisfaction contrainte</term>
<term>Langage probabiliste</term>
<term>Langage naturel</term>
<term>Traitement langage</term>
<term>Analyse syntaxique</term>
<term>Phrase</term>
<term>Optimisation sous contrainte</term>
<term>Approche probabiliste</term>
</keywords><front><div type="abstract" xml:lang="en">This paper describes an exploratory implementation in Mozart applying constraint optimization to basic subproblems of parsing and generation. Optimization is performed on the probability of a sentence using a dependency-style syntactic representation, which is computed using an adaptation of the English Penn Treebank as data. The same program solves both parsing and generation subproblems, providing the flexibility of a general architecture combined with practical efficiency. We show results on a sample sentence that is a classic in natural language processing.</div>
</front><inist><standard h6="B"><pA><fA01 i1="01" i2="1"><s0>0302-9743</s0>
</fA01><fA05><s2>3438</s2>
</fA05><fA08 i1="01" i2="1" l="ENG"><s1>An exploratory application of constraint optimization in mozart to probabilistic natural language processing</s1>
</fA08><fA09 i1="01" i2="1" l="ENG"><s1>CSLP 2004 : constraint solving and language processing : Roskilde, 1-3 September 2004, revised selected and invited papers</s1>
</fA09><fA11 i1="01" i2="1"><s1>LANGKILDE-GEARY (Irene)</s1>
</fA11><fA12 i1="01" i2="1"><s1>CHRISTIANSEN (Henning)</s1>
<s9>ed.</s9>
</fA12><fA12 i1="02" i2="1"><s1>SKADHAUGE (Peter Rossen)</s1>
<s9>ed.</s9>
</fA12><fA12 i1="03" i2="1"><s1>VILLADSEN (Jorgen)</s1>
<s9>ed.</s9>
</fA12><fA14 i1="01"><s1>Brigham Young University</s1>
<s2>Provo UT 84602</s2>
<s3>USA</s3>
<sZ>1 aut.</sZ>
</fA14><fA20><s1>172-183</s1>
</fA20><fA21><s1>2005</s1>
</fA21><fA23 i1="01"><s0>ENG</s0>
</fA23><fA26 i1="01"><s0>3-540-26165-6</s0>
</fA26><fA43 i1="01"><s1>INIST</s1>
<s2>16343</s2>
<s5>354000124486690110</s5>
</fA43><fA44><s0>0000</s0>
<s1>© 2005 INIST-CNRS. All rights reserved.</s1>
</fA44><fA45><s0>12 ref.</s0>
</fA45><fA47 i1="01" i2="1"><s0>05-0295484</s0>
</fA47><fA60><s1>P</s1>
<s2>C</s2>
</fA60><fA64 i1="01" i2="1"><s0>Lecture notes in computer science</s0>
</fA64><fA66 i1="01"><s0>DEU</s0>
</fA66><fC01 i1="01" l="ENG"><s0>This paper describes an exploratory implementation in Mozart applying constraint optimization to basic subproblems of parsing and generation. Optimization is performed on the probability of a sentence using a dependency-style syntactic representation, which is computed using an adaptation of the English Penn Treebank as data. The same program solves both parsing and generation subproblems, providing the flexibility of a general architecture combined with practical efficiency. We show results on a sample sentence that is a classic in natural language processing.</s0>
</fC01><fC02 i1="01" i2="X"><s0>001D02C04</s0>
</fC02><fC03 i1="01" i2="X" l="FRE"><s0>Linguistique mathématique</s0>
<s5>01</s5>
</fC03><fC03 i1="01" i2="X" l="ENG"><s0>Computational linguistics</s0>
<s5>01</s5>
</fC03><fC03 i1="01" i2="X" l="SPA"><s0>Linguística matemática</s0>
<s5>01</s5>
</fC03><fC03 i1="02" i2="X" l="FRE"><s0>Satisfaction contrainte</s0>
<s5>02</s5>
</fC03><fC03 i1="02" i2="X" l="ENG"><s0>Constraint satisfaction</s0>
<s5>02</s5>
</fC03><fC03 i1="02" i2="X" l="SPA"><s0>Satisfaccion restricción</s0>
<s5>02</s5>
</fC03><fC03 i1="03" i2="X" l="FRE"><s0>Langage probabiliste</s0>
<s5>06</s5>
</fC03><fC03 i1="03" i2="X" l="ENG"><s0>Probabilistic language</s0>
<s5>06</s5>
</fC03><fC03 i1="03" i2="X" l="SPA"><s0>Lenguaje probabilista</s0>
<s5>06</s5>
</fC03><fC03 i1="04" i2="X" l="FRE"><s0>Langage naturel</s0>
<s5>07</s5>
</fC03><fC03 i1="04" i2="X" l="ENG"><s0>Natural language</s0>
<s5>07</s5>
</fC03><fC03 i1="04" i2="X" l="SPA"><s0>Lenguaje natural</s0>
<s5>07</s5>
</fC03><fC03 i1="05" i2="X" l="FRE"><s0>Traitement langage</s0>
<s5>08</s5>
</fC03><fC03 i1="05" i2="X" l="ENG"><s0>Language processing</s0>
<s5>08</s5>
</fC03><fC03 i1="05" i2="X" l="SPA"><s0>Tratamiento lenguaje</s0>
<s5>08</s5>
</fC03><fC03 i1="06" i2="X" l="FRE"><s0>Analyse syntaxique</s0>
<s5>09</s5>
</fC03><fC03 i1="06" i2="X" l="ENG"><s0>Syntactic analysis</s0>
<s5>09</s5>
</fC03><fC03 i1="06" i2="X" l="SPA"><s0>Análisis sintáxico</s0>
<s5>09</s5>
</fC03><fC03 i1="07" i2="X" l="FRE"><s0>Phrase</s0>
<s5>18</s5>
</fC03><fC03 i1="07" i2="X" l="ENG"><s0>Sentence</s0>
<s5>18</s5>
</fC03><fC03 i1="07" i2="X" l="SPA"><s0>Frase</s0>
<s5>18</s5>
</fC03><fC03 i1="08" i2="X" l="FRE"><s0>Optimisation sous contrainte</s0>
<s5>23</s5>
</fC03><fC03 i1="08" i2="X" l="ENG"><s0>Constrained optimization</s0>
<s5>23</s5>
</fC03><fC03 i1="08" i2="X" l="SPA"><s0>Optimización con restricción</s0>
<s5>23</s5>
</fC03><fC03 i1="09" i2="X" l="FRE"><s0>Approche probabiliste</s0>
<s5>24</s5>
</fC03><fC03 i1="09" i2="X" l="ENG"><s0>Probabilistic approach</s0>
<s5>24</s5>
</fC03><fC03 i1="09" i2="X" l="SPA"><s0>Enfoque probabilista</s0>
<s5>24</s5>
</fC03><fN21><s1>206</s1>
</fN21><fN44 i1="01"><s1>OTO</s1>
</fN44><fN82><s1>OTO</s1>
</fN82><pR><fA30 i1="01" i2="1" l="ENG"><s1>Constraint solving and language processing. International workshop</s1>
<s2>1</s2>
<s3>Roskilde DNK</s3>
<s4>2004-09-01</s4>
</fA30>
Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Musique/explor/MozartV1/Data/PascalFrancis/Curation
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000029 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/PascalFrancis/Curation/biblio.hfd -nk 000029 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Musique
|area= MozartV1
|flux= PascalFrancis
|étape= Curation
|type= RBID
|clé= Pascal:05-0295484
|texte= An exploratory application of constraint optimization in mozart to probabilistic natural language processing
}}
| This area was generated with Dilib version V0.6.20.
Data generation: Sun Apr 10 15:06:14 2016. Site generation: Tue Feb 7 15:40:35 2023 |  |
